Multiple Output Complex Instruction Matching Algorithm for Extensible Processors
نویسندگان
چکیده
منابع مشابه
INSIDE: INstruction Selection/Identification & Design Exploration for Extensible Processors
This paper presents the INSIDE system that rapidly searches the design space for extensible processors, given area and performance constraints of an embedded application, while minimizing the design turn-around-time. Our system consists of a) a methodology to determine which code segments are most suited for implementation as a set of extensible instructions, b) a heuristic algorithm to select ...
متن کاملINSIDE: INstruction Selection/ldentification & Design Exploration for Extensible Processors
This paper presents the INSIDE system that rapidly searches the design space for extensible processors, given area and performance constraints of an embedded application, while minimizing the design turn-around-time. Our system consists Of a ) a methodology to determine which code segments are most suited for implementation a5 a set of extensible instructions, b) a heuristic algorithm to select...
متن کاملComplex Instruction In A Superscalar Processors
A complex instruc7on set computer is a computer where single instruc7ons can execute several obscure BiT oriented instruction sets, RISC Instructions Superscalar processors of the 1990s had the func7onal units to execute mul7ple. Preface This book emerged from the course Superscalar Processor Design, which has While the instruction count may go down M O D E R N PROCESSOR Significant effort has ...
متن کاملAllocating registers in multiple instruction-issuing processors
This work addresses the problem of scheduling a basic block of operations on a multiple instruction-issuing processor. We show that integrating register constraints into operation sequencing algorithms is a complex problem in itself. Indeed, while scheduling a forest of unit time operations on a processor with P parallel instruction slots can be solved in polynomial time, the problem becomes NP...
متن کاملA high-performance sorting algorithm for multicore single-instruction multiple-data processors
Many sorting algorithms have been studied in the past, but there are only a few algorithms that can effectively exploit both SIMD instructions and thread-level parallelism. In this paper, we propose a new high-performance sorting algorithm, called Aligned-Access sort (AA-sort), for exploiting both the SIMD instructions and thread-level parallelism available on today's multicore processors. Our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/7897-1240